Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
541	Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY Lecture notes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2013-10-08 12:14:22 Computer science Turing machine Models of computation Alan Turing Universal Turing machine Computability Computational complexity theory Halting problem Church–Turing thesis Theoretical computer science Computability theory Theory of computation
542	Aligning Biomolecular Networks Using Modular Graph Kernels Fadi Towﬁc1,2, , M. Heather West Greenlee1,3 , and Vasant Honavar1,2 1 Bioinformatics and Computational Biology Graduate Program Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2009-07-28 18:01:31 Subgraph isomorphism problem Neighbourhood Graph Connected component Shortest path problem Clique Graph theory Mathematics Theoretical computer science
543	CS355: Topics in cryptography Spring 2014 Assignment #1 Due: Tuesday, May. 13, 2014. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-05-07 00:53:37 Finite fields Cryptographic protocols Computational hardness assumptions Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange Digital signature PP One-way function Cryptography Abstract algebra Mathematics
544	Adaptive Greedy Approximations1 Georey Davis Mathematics Department, Dartmouth College Hanover, NHStephane Mallat, Marco Avellaneda Add to Reading List Source URL: www.geoffdavis.net Language: English NP-complete problems Complexity classes Combinatorial optimization Approximation algorithm NP Set cover problem Reduction Matching pursuit Matching Theoretical computer science Computational complexity theory Applied mathematics
545	Motivation COMS21103 NP-completeness Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes NP-complete NP-hard P versus NP problem NP Cook–Levin theorem Boolean satisfiability problem PP P Theoretical computer science Computational complexity theory Applied mathematics
546	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2007-01-06 01:59:49 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields
547	CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-02-18 23:13:10 Finite fields Computational hardness assumptions Diffie–Hellman key exchange ElGamal encryption XTR RSA Diffie–Hellman problem Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Cryptographic protocols
548	Computational Evidence that Self-regulation of Creativity is Good for Society Liane Gabora () University of British Columbia Department of Psychology, Okanagan campus, Arts Building, 3333 University Wa Add to Reading List Source URL: mindmodeling.org Language: English - Date: 2014-08-06 21:14:02 Creativity Cognitive science Year of birth missing Educational psychology Problem solving Liane Gabora Culture Structural functionalism Greatness Mind Cognition Philosophy of mind
549	CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-03-05 19:45:19 Computational hardness assumptions Electronic commerce Cryptographic protocols RSA Diffie–Hellman key exchange ElGamal encryption XTR Diffie–Hellman problem Computational Diffie–Hellman assumption Cryptography Public-key cryptography Finite fields
550	CS255: Cryptography and Computer Security Winter 2001 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-01-04 13:22:38 Cryptographic protocols Electronic commerce Computational hardness assumptions RSA Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm Schmidt–Samoa cryptosystem Paillier cryptosystem Cryptography Public-key cryptography Finite fields

UPDATE